Contractions, Removals and How to Certify 3-Connectivity in Linear Time

It is well-known as an existence result that every 3-connected graph G=(V,E) on more than 4 vertices admits a sequence of contractions and a sequence of removal operations to K_4 such that every intermediate graph is 3-connected. We show that both sequences can be computed in optimal time, improving the previously best known running times of O(|V|^2) to O(|V|+|E|). This settles also the open question of finding a linear time 3-connectivity test that is certifying and extends to a certifying 3-edge-connectivity test in the same time. The certificates used are easy to verify in time O(|E|).Comment: preliminary versio

Lyapunov-Schmidt Reduction for Unfolding Heteroclinic Networks of Equilibria and Periodic Orbits with Tangencies

This article concerns arbitrary finite heteroclinic networks in any phase space dimension whose vertices can be a random mixture of equilibria and periodic orbits. In addition, tangencies in the intersection of un/stable manifolds are allowed. The main result is a reduction to algebraic equations of the problem to find all solutions that are close to the heteroclinic network for all time, and their parameter values. A leading order expansion is given in terms of the time spent near vertices and, if applicable, the location on the non-trivial tangent directions. The only difference between a periodic orbit and an equilibrium is that the time parameter is discrete for a periodic orbit. The essential assumptions are hyperbolicity of the vertices and transversality of parameters. Using the result, conjugacy to shift dynamics for a generic homoclinic orbit to a periodic orbit is proven. Finally, equilibrium-to-periodic orbit heteroclinic cycles of various types are considered

Rotation-limited growth of three dimensional body-centered cubic crystals

According to classical grain growth laws, grain growth is driven by the minimization of surface energy and will continue until a single grain prevails. These laws do not take into account the lattice anisotropy and the details of the microscopic rearrangement of mass between grains. Here we consider coarsening of body-centered cubic polycrystalline materials in three dimensions using the phase field crystal model. We observe as function of the quenching depth, a cross over between a state where grain rotation halts and the growth stagnates and a state where grains coarsen rapidly by coalescence through rotation and alignment of the lattices of neighboring grains. We show that the grain rotation per volume change of a grain follows a power law with an exponent of $-1.25$. The scaling exponent is consistent with theoretical considerations based on the conservation of dislocations

Edge-Orders

Canonical orderings and their relatives such as st-numberings have been used as a key tool in algorithmic graph theory for the last decades. Recently, a unifying concept behind all these orders has been shown: they can be described by a graph decomposition into parts that have a prescribed vertex-connectivity. Despite extensive interest in canonical orderings, no analogue of this unifying concept is known for edge-connectivity. In this paper, we establish such a concept named edge-orders and show how to compute (1,1)-edge-orders of 2-edge-connected graphs as well as (2,1)-edge-orders of 3-edge-connected graphs in linear time, respectively. While the former can be seen as the edge-variants of st-numberings, the latter are the edge-variants of Mondshein sequences and non-separating ear decompositions. The methods that we use for obtaining such edge-orders differ considerably in almost all details from the ones used for their vertex-counterparts, as different graph-theoretic constructions are used in the inductive proof and standard reductions from edge- to vertex-connectivity are bound to fail. As a first application, we consider the famous Edge-Independent Spanning Tree Conjecture, which asserts that every k-edge-connected graph contains k rooted spanning trees that are pairwise edge-independent. We illustrate the impact of the above edge-orders by deducing algorithms that construct 2- and 3-edge independent spanning trees of 2- and 3-edge-connected graphs, the latter of which improves the best known running time from O(n^2) to linear time